An Online Expectation-Maximisation Algorithm for Nonnegative Matrix Factorisation Models
نویسندگان
چکیده
In this paper we formulate the nonnegative matrix factorisation (NMF) problem as a maximum likelihood estimation problem for hidden Markov models and propose online expectation-maximisation (EM) algorithms to estimate the NMF and the other unknown static parameters. We also propose a sequential Monte Carlo approximation of our online EM algorithm. We show the performance of the proposed method with two numerical examples.
منابع مشابه
Bayesian Inference for Nonnegative Matrix Factorisation Models
We describe nonnegative matrix factorisation (NMF) with a Kullback-Leibler (KL) error measure in a statistical framework, with a hierarchical generative model consisting of an observation and a prior component. Omitting the prior leads to the standard KL-NMF algorithms as special cases, where maximum likelihood parameter estimation is carried out via the Expectation-Maximisation (EM) algorithm....
متن کاملDirectional Clustering through Matrix Factorisation
In this paper we are interested in directional clustering, that is, in grouping of feature vectors depending on their direction, so that the angles between pairs of features from the same cluster are small. The assignment of features to clusters is here cast as a constrained low-rank matrix factorisation problem, which can be solved using ideas similar to those used to compute similar matrix fa...
متن کاملAlgorithme EM en ligne simulé pour la factorisation non-négative probabiliste
This paper describes a general purpose algorithm for online estimation in probabilistic latent factor models. The algorithm called simulated online EM is an extension of the online EM algorithm of Cappé & Moulines (2009) based on the use of MCMC simulations to approximate individual E-steps. The algorithm is applied to perform unsupervised analysis of audio signals using a probabilistic version...
متن کاملProbabilistic non-negative matrix factorisation and extensions
Matrix factorisation models have had an explosive growth in popularity in the last decade. It has become popular due to its usefulness in clustering and missing values prediction. We review the main literature for matrix factorisation, focusing on nonnegative matrix factorisation and probabilistic approaches. We also consider several extensions: matrix tri-factorisation, Tensor factorisation, T...
متن کاملNEW MODELS AND ALGORITHMS FOR SOLUTIONS OF SINGLE-SIGNED FULLY FUZZY LR LINEAR SYSTEMS
We present a model and propose an approach to compute an approximate solution of Fully Fuzzy Linear System $(FFLS)$ of equations in which all the components of the coefficient matrix are either nonnegative or nonpositive. First, in discussing an $FFLS$ with a nonnegative coefficient matrix, we consider an equivalent $FFLS$ by using an appropriate permutation to simplify fuzzy multiplications. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1401.2490 شماره
صفحات -
تاریخ انتشار 2012